Chance-Constrained Optimal Path Planning With Obstacles
نویسندگان
چکیده
منابع مشابه
Optimal Control for Constrained Coverage Path Planning
The problem of constrained coverage path planning involves a robot trying to cover maximum area of an environment under some constraints that appear as obstacles in the map. Out of the several coverage path planning methods, we consider augmenting the linear sweep-based coverage method to achieve minimum energy/ time optimality along with maximum area coverage. In addition, we also study the ef...
متن کاملMulti-agent Optimal Path Planning for Mobile Robots in Environment with Obstacles
The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation of environment models is described. When planning the path of each robot, the graph model of environment is dynamically changed for path correction and collision avoidance. New algorithm applies changes of robots’ paths and spe...
متن کاملPath-Planning by Tessellation of Obstacles
We describe two algorithms for static path-planning, with the aim of deriving the trajectory that always maximises the distance of the path from the nearest obstacle. The bubble algorithm allocates individual pixels to generating points, growing the area owned by each point at a globally constant rate to ensure that boundaries are equidistant between neighbouring points. The geometric algorithm...
متن کاملContinuous-Field Path Planning with Constrained Path-Dependent State Variables
Planning autonomous long range traverses for planetary exploration and similar robotic missions requires several important capabilities. These include the ability to generate smooth, optimal paths, the ability to reason about constrained path-dependent state variables such as energy, and the ability to replan rapidly in response to new information. Existing path planning approaches provide one ...
متن کاملA Maneuvering-Board Approach to Path Planning with Moving Obstacles
In this paper we describe a new approach to the problem of path planning with moving obstacles. Our approach is based on the maneuvering board method commonly used for nautical navigation. We have extended this method to handle cases where obstacles may maneuver at any time and where knowledge of the position and velocity of the obstacles may be uncertain.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Robotics
سال: 2011
ISSN: 1552-3098,1941-0468
DOI: 10.1109/tro.2011.2161160